/*-
 * Copyright (c) 2006, 2007 FTS Team
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 4. Neither the name of the FTS Team nor the names of its contributors
 *    may be used to endorse or promote products derived from this software
 *    without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 *
 *      LemCache.cpp
 *
 * $FTS$
 */
#include <LemCache.hpp>
#include <stdio.h>

#include <STLVector.hpp>
#include <STLString.hpp>

namespace FTSS // FullTextSearchSystem
{

//
// Constructor
//
LemCache::LemCache(LemmatizerInterface & oILemmatizer, Size_t iDictSize): oLemmatizer(oILemmatizer), oLemHash(iDictSize)
{
	;;
}

//
// Get cached word from word cache
//
CachedWord * LemCache::GetWord(CCHAR_P sWord, const UINT_32 & iWordLength)
{
	TokenHash_t iHash = HashFunc(sWord, iWordLength);
	TokenHash_t iValHash = HashHasher().operator()(iHash);

	LemHash::iterator ithData = oLemHash.find(iHash, iValHash);
	// Word found
	if (ithData != oLemHash.end()) { return ithData -> second; }
	// else ....
	// Word not found.
	// Lemmatize word if need
	CachedWord * aWords = NULL;

	if (oLemmatizer.CanLemmatize(sWord, iWordLength) == -1)
	{
		Size_t iWordForms = 2;
		aWords = new CachedWord[iWordForms + 1];
		aWords[0].word_hash = iHash;
		aWords[0].word_form = iHash;
		aWords[1].word_hash = 0;
	}
	else
	{
		using STLW::string;
		using STLW::vector;

		vector<string> vFirstFormsQuick = oLemmatizer.FirstForms(sWord, iWordLength, 1);

		Size_t iWordForms = vFirstFormsQuick.size();
		if (iWordForms > C_MAX_FIRST_FORMS) { iWordForms = C_MAX_FIRST_FORMS - 1; }

		aWords = new CachedWord[iWordForms + 1];
		Size_t iI = 0;
		for(iI = 0; iI < iWordForms; iI++)
		{
			aWords[iI].word_hash = HashFunc(vFirstFormsQuick[iI].c_str(), vFirstFormsQuick[iI].size());
			// Because we need to compare only this form of word
			aWords[iI].word_form = iHash;
		}
		aWords[iI].word_hash = 0;
	}

	oLemHash.insert(LemPair(iHash, aWords), iValHash);

return aWords;
}

//
// A Destructor
//
LemCache::~LemCache() throw()
{
	LemHash::iterator ithData = oLemHash.begin();
	while (ithData != oLemHash.end())
	{
		delete [] ithData -> second;
		++ithData;
	}
}

} // namespace FTSS
// End.
